|
|
Decompilation of High-Level Constructions in C++ Binaries
Jakub, Dušan ; Křivka, Zbyněk (referee) ; Matula, Peter (advisor)
The thesis addresses the decompilation of high-level object-oriented C++ language from a machine code. The term reverse engineering is defined and existing decompilers are described with emphasis on their ability to reconstruct C++. AVG decompiler project is introduced, to which this thesis contributes. C++ language is analysed, both on a logical level and in the machine code and existing methods of decompilation are described. On this basis a novel method is introduced, capable of decompiling classes, their hierarchy, constructors, destructors and definitions and usages of virtual methods. The method is implemented, tested and evaluated. In the conclusion, several suggestions for future development of this project are presented.
|
|
|
Formula 1 as a Sport and Social Phenomenon in the 1950s and 1960s
Fendrychová, Michaela ; Kovář, Martin (advisor) ; Soukup, Jaromír (referee)
Bachelor thesis is focused on analysis of races formula 1 as a Sport and Social Phenomenon in the 1950s and 1960s. The author focused in the introduction on recapitulation beginning car races from 1894. The main part of thesis regards world championship in Fifties and Sixties. The author analysed particular seasons of the championship and concentrated on career of the best drivers - champions (for example Guiseppe Farina, Juan Manuel Fangio, Albert Ascari etcetera) as well as drivers, who didn't win world title (for example Stirling Moss) or Jochen Rindt (he got world title in memoriam, but in 1970 and this is not observed period). Analysis of running the most important teams follows (Alfa Romeo, Ferrari, Maserati, Mercedes, Lotus and McLaren).
|
|
|
Competitive filling of a plane region
Slabý, David ; Valtr, Pavel (advisor) ; Valla, Tomáš (referee)
Two players take alternating turns filling a rectangular board with unit squares without rotation, but may be otherwise arbitrary. Squares may not overlap and the game ends when there is no space for the next one. The result of the game is the number of turns. The constructor aims to maximize this quantity while the destructor wants to minimize it. We would like to get close to this value, provided that both players use their optimal strategy. We prove some new lower and upper bound for the game. This thesis extends results given by Tamás Hubai in his paper Competitive rectangle filling. Furthermore, we have a look at other board shapes and shapes to fill with.
|
|
|
Decompilation of High-Level Constructions in C++ Binaries
Jakub, Dušan ; Křivka, Zbyněk (referee) ; Matula, Peter (advisor)
The thesis addresses the decompilation of high-level object-oriented C++ language from a machine code. The term reverse engineering is defined and existing decompilers are described with emphasis on their ability to reconstruct C++. AVG decompiler project is introduced, to which this thesis contributes. C++ language is analysed, both on a logical level and in the machine code and existing methods of decompilation are described. On this basis a novel method is introduced, capable of decompiling classes, their hierarchy, constructors, destructors and definitions and usages of virtual methods. The method is implemented, tested and evaluated. In the conclusion, several suggestions for future development of this project are presented.
|
guest ::
